Practically Feasible Robust Quantum Money with Classical Verification

A practically feasible entanglement assisted quantum key distribution protocol

We give an entanglement assisted scheme for quantum key distribution. The scheme requires the maximally entangled 2-qubit state but does not require any quantum storage. Given the symmetric noisy channel, our scheme can tolerate the bit error rate up to 26% in the 4-state case and 30% in the 6-state respectively, respectively. These values are higher than those of all currently known two-level-...

Quantum vs Classical Proofs and Subset Verification

We study the ability of efficient quantum verifiers to decide properties of exponentially large subsets given either a classical or quantum witness. We develop a general framework that can be used to prove that QCMA machines, with only classical witnesses, cannot verify certain properties of subsets given implicitly via an oracle. We use this framework to prove an oracle separation between QCMA...

Wheat and Chaff - Practically Feasible Interactive Ontology Revision

When ontological knowledge is acquired automatically, quality control is essential. We consider the tightest possible approach – an exhaustive manual inspection of the acquired data. By using automated reasoning, we partially automate the process: after each expert decision, axioms that are entailed by the already approved statements are automatically approved, whereas axioms that would lead to...

Classical verification of quantum circuits containing few basis changes

We consider the task of verifying the correctness of quantum computation for a restricted class of circuits which contain at most two basis changes. This contains circuits giving rise to the second level of the Fourier Hierarchy, the lowest level for which there is an established quantum advantage. We show that, when the circuit has an outcome with probability at least the inverse of some polyn...

Quantum cloning, Quantum Money, and Quantum Monogamy